package anthology.daily_question._24_12;
//https://leetcode.cn/problems/final-array-state-after-k-multiplication-operations-i/description/?envType=daily-question&envId=2024-12-13
public class _3264K次乘运算后的最终数组1 {
    class Solution {
        public int[] getFinalState(int[] nums, int k, int multiplier) {
            for(int i=0; i<k; i++){
                int m = 0;
                for(int j=0; j<nums.length; j++){
                    if(nums[m]>nums[j]){
                        m = j;
                    }
                }
                nums[m] *= multiplier;
            }
            return nums;
        }
    }
}
